Graphs with Obstacle Number Greater than One
نویسندگان
چکیده
منابع مشابه
Spaces with Conformal Dimension Greater than One
We show that if a complete, doubling metric space is annulus linearly connected then its conformal dimension is greater than one, quantitatively. As a consequence, hyperbolic groups whose boundaries have no local cut points have conformal dimension greater than one; this answers a question of Bonk and Kleiner.
متن کاملTwo is Greater than One
In this paper we highlight the benefits of using genus-2 curves in public-key cryptography. Compared to the standardized genus-1 curves, or elliptic curves, arithmetic on genus-2 curves is typically more involved but allows us to work with moduli of half the size. We give a taxonomy of the best known techniques to realize genus-2 based cryptography, which includes fast formulas on the Kummer su...
متن کاملfinite simple groups with number of zeros slightly greater than the number of nonlinear irreducible characters
the aim of this paper is to classify the finite simple groups with the number of zeros at most seven greater than the number of nonlinear irreducible characters in the character tables. we find that they are exactly a$_{5}$, l$_{2}(7)$ and a$_{6}$.
متن کاملConstruction of a Number Greater than One Whose Powers Are Uniformly Distributed modulo One
We study how to construct a number greater than one whose powers are uniformly distributed modulo 1. Also we prove that for every λ > 0 there is a dense set of computable numbers α > 1 such that the discrepancy of {λα}n=1 is O(N − 1 4+ε ).
متن کاملOn the Structure of Graphs with Low Obstacle Number
The obstacle number of a graph G is the smallest number of polygonal obstacles in the plane with the property that the vertices of G can be represented by distinct points such that two of them see each other if and only if the corresponding vertices are joined by an edge. We list three small graphs that require more than one obstacle. Using extremal graph theoretic tools developed by Prömel, St...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2017
ISSN: 1526-1719
DOI: 10.7155/jgaa.00452